Robust Range-Only Mapping via Sum-of-Squares Polynomials
نویسندگان
چکیده
منابع مشابه
Minimizing Polynomials via Sum of Squares over the Gradient Ideal
A method is proposed for finding the global minimum of a multivariate polynomial via sum of squares (SOS) relaxation over its gradient variety. That variety consists of all points where the gradient is zero and it need not be finite. A polynomial which is nonnegative on its gradient variety is shown to be SOS modulo its gradient ideal, provided the gradient ideal is radical or the polynomial is...
متن کاملOutlier-robust moment-estimation via sum-of-squares
We develop efficient algorithms for estimating low-degree moments of unknown distributions in the presence of adversarial outliers. The guarantees of our algorithms improve in many cases significantly over the best previous ones, obtained in recent works of [DKK16, LRV16, CSV17]. We also show that the guarantees of our algorithms match information-theoretic lower-bounds for the class of distrib...
متن کاملA Robust Method of Localization and Mapping Using Only Range
In this paper we present results in mobile robot localization and simultaneous localization and mapping (SLAM) using range from radio. In previous work we have shown how range readings from radio tags placed in the environment can be used to localize a robot and map tag locations using a standard extended Kalman filter (EKF) that linearizes the probability distribution due to range measurements...
متن کاملThe Pythagoras number of real sum of squares polynomials and sum of square magnitudes of polynomials
In this paper, we conjecture a formula for the value of the Pythagoras number for real multivariate sum of squares polynomials as a function of the (total or coordinate) degree and the number of variables. The conjecture is based on the comparison between the number of parameters and the number of conditions for a corresponding low-rank representation. This is then numerically verified for a nu...
متن کاملGeometry of 3D Environments and Sum of Squares Polynomials
Motivated by applications in robotics and computer vision, we study problems related to spatial reasoning of a 3D environment using sublevel sets of polynomials. These include: tightly containing a cloud of points (e.g., representing an obstacle) with convex or nearly-convex basic semialgebraic sets, computation of Euclidean distances between two such sets, separation of two convex basic semalg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2017
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2017.08.1598